Search for: All records

Honey bees are a commonly used species for alcohol research due to their genome being fully sequenced, their behavioral changes following consumption, and their preference for alcohol. The purpose of this article is to provide a preliminary examination of the genetic expression of heat shock protein 70 (HSP70) and big potassium ion channel protein (BKP) in honey bees following the consumption of either 0%, 2.5%, 5%, or 10% ethanol (EtOH) solutions. The foraging behaviors of the bees were observed and recorded through their return and drinking times. There were significant differences in the return and drinking times between some of the groups. The bees in the 10% condition took significantly longer to return compared to the other groups. Additionally, the bees in the 5% group spent significantly more time drinking compared to the bees in the control (0%) group. There were no significant differences in HSP70 or BKP between the different ethanol groups. Cumulatively, these findings suggest that, while bees may exhibit behavioral differences, the differences in gene expression may not be observed at the transcriptional level. 

The codewords of the homomorphism code aHom(G,H) are the affine homomorphisms between two finite groups, G and H, generalizing Hadamard codes. Following the work of Goldreich-Levin (1989), Grigorescu et al. (2006), Dinur et al. (2008), and Guo and Sudan (2014), we further expand the range of groups for which local list-decoding is possible up to mindist, the minimum distance of the code. In particular, for the first time, we do not require either G or H to be solvable. Specifically, we demonstrate a poly(1/epsilon) bound on the list size, i. e., on the number of codewords within distance (mindist-epsilon) from any received word, when G is either abelian or an alternating group, and H is an arbitrary (finite or infinite) group. We conjecture that a similar bound holds for all finite simple groups as domains; the alternating groups serve as the first test case. The abelian vs. arbitrary result permits us to adapt previous techniques to obtain efficient local list-decoding for this case. We also obtain efficient local list-decoding for the permutation representations of alternating groups (the codomain is a symmetric group) under the restriction that the domain G=A_n is paired with codomain H=S_m satisfying m < 2^{n-1}/sqrt{n}. The limitations on the codomain in the latter case arise from severe technical difficulties stemming from the need to solve the homomorphism extension (HomExt) problem in certain cases; these are addressed in a separate paper (Wuu 2018). We introduce an intermediate "semi-algorithmic" model we call Certificate List-Decoding that bypasses the HomExt bottleneck and works in the alternating vs. arbitrary setting. A certificate list-decoder produces partial homomorphisms that uniquely extend to the homomorphisms in the list. A homomorphism extender applied to a list of certificates yields the desired list.